منابع مشابه
Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
We consider stochastic, time-varying transportation networks, where the arc weights (arc travel times) are random variables with probability distribution functions that vary with time. Efficient procedures are widely available for determining least time paths in deterministic networks. In stochastic but time-invariant networks, least expected time paths can be determined by setting each random ...
متن کاملPacking paths of length at least two
We give a simple proof for Kaneko’s theorem which gives a su2cient and necessary condition for the existence of vertex disjoint paths in a graph, each of length at least two, that altogether cover all vertices of the original graph. Moreover we generalize this theorem and give a formula for the maximum number of vertices that can be covered by such a path system. c © 2004 Elsevier B.V. All righ...
متن کاملAdaptive least-expected time paths in stochastic, time-varying transportation and data networks
In congested transportation and data networks, travel (or transmission) times are time-varying quantities that are at best known a priori with uncertainty. In such stochastic, time-varying (or STV) networks, one can choose to use the a priori least-expected time (LET) path or one can make improved routing decisions en route as traversal times on traveled arcs are experienced and arrival times a...
متن کاملFinding least fuel emission paths in a network with time-varying speeds
This paper considers the problem of finding a route and schedule for a vehicle starting from a depot, visiting a set of customers and returning to the depot, in a time-dependent network where the objective is to minimize the greenhouse gas emissions. In this formulation, the speeds of the vehicle as well as the routes chosen are decision variables subject to limits determined by the level of co...
متن کاملFinding Good Paths: Applications of Least Cost Caloric Path Computations
As you walk around during your daily life, you commonly make path finding decisions based on the world around you. For example, when you are walking in the outdoors, you take the path of least resistance over a terrain. We present two applications which demonstrate the importance of using the least cost caloric cost path computation in two different domain settings. One application uses the pop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monthly Notices of the Royal Astronomical Society
سال: 2011
ISSN: 0035-8711
DOI: 10.1111/j.1365-2966.2011.19242.x